{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T14:53:07Z","timestamp":1787583187694,"version":"build-2736575974"},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5982,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1006\/jctb.1996.1741","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T16:59:59Z","timestamp":1034009999000},"page":"193-209","source":"Crossref","is-referenced-by-count":27,"title":["Subgraph Counting Identities and Ramsey Numbers"],"prefix":"10.1006","volume":"69","author":[{"given":"Brendan D","family":"McKay","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stanis\u0142aw P","family":"Radziszowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1006\/jctb.1996.1741_TB961741RF1","unstructured":"H. L. Abbott, 1965, Some Problems in Combinatorial Analysis, University of Alberta, Edmonton"},{"key":"10.1006\/jctb.1996.1741_TB961741RF2","series-title":"MAPLE Reference Manual","author":"Char","year":"1990"},{"key":"10.1006\/jctb.1996.1741_TB961741RF3","series-title":"Graph Theory and Related Topics","article-title":"Strong independence of graphcopy functions","author":"Erd\u0151s","year":"1979"},{"key":"10.1006\/jctb.1996.1741_TB961741RF4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/jgt.3190130113","article-title":"A lower bound forR","volume":"13","author":"Exoo","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1006\/jctb.1996.1741_TB961741RF5","first-page":"1","article-title":"On the Ramsey numbersRRR","volume":"35","author":"Exoo","year":"1993","journal-title":"Ars Combinatoria"},{"key":"10.1006\/jctb.1996.1741_TB961741RF6","first-page":"809","article-title":"Une majoration du nombre de Ramsey binaire-bicolore en (5,5)","volume":"265","author":"Giraud","year":"1967","journal-title":"C. R. Acad. Sci. Paris"},{"key":"10.1006\/jctb.1996.1741_TB961741RF7","doi-asserted-by":"crossref","first-page":"778","DOI":"10.2307\/2310464","article-title":"On sets of acquaintances and strangers at any party","volume":"66","author":"Goodman","year":"1959","journal-title":"Amer. Math. Monthly"},{"key":"10.1006\/jctb.1996.1741_TB961741RF8","unstructured":"R. W. Irving, 1973, Contributions to Ramsey Theory, University of Glasgow"},{"key":"10.1006\/jctb.1996.1741_TB961741RF9","doi-asserted-by":"crossref","first-page":"575","DOI":"10.4153\/CMB-1965-041-7","article-title":"Construction of special edge-chromatic graphs","volume":"8","author":"Kalbfleisch","year":"1965","journal-title":"Canad. Math. Bull."},{"key":"10.1006\/jctb.1996.1741_TB961741RF10","unstructured":"J. G. Kalbfleisch, 1966, Chromatic Graphs and Ramsey's Theorem, University of Waterloo"},{"key":"10.1006\/jctb.1996.1741_TB961741RF11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0021-9800(67)80112-1","article-title":"Upper bounds for some Ramsey numbers","volume":"2","author":"Kalbfleisch","year":"1967","journal-title":"J. Combin. Theory"},{"key":"10.1006\/jctb.1996.1741_TB961741RF12","first-page":"109","article-title":"An extension of Kelly's lemma to spanning subgraphs","volume":"31","author":"Kocay","year":"1981","journal-title":"Congr. Numer."},{"key":"10.1006\/jctb.1996.1741_TB961741RF13","author":"McKay","year":"1990","journal-title":"Technical report TR-CS-90-02"},{"key":"10.1006\/jctb.1996.1741_TB961741RF14","author":"McKay","year":"1996","journal-title":"Technical Report TR-CS-96-03"},{"key":"10.1006\/jctb.1996.1741_TB961741RF15","first-page":"13","article-title":"A new upper bound for the Ramsey numberR","volume":"5","author":"McKay","year":"1992","journal-title":"Australasian J. Combin"},{"key":"10.1006\/jctb.1996.1741_TB961741RF16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1006\/jctb.1994.1038","article-title":"Linear programming in some Ramsey problems","volume":"61","author":"McKay","year":"1994","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1006\/jctb.1996.1741_TB961741RF17","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190190304","article-title":"R","volume":"19","author":"McKay","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1006\/jctb.1996.1741_TB961741RF18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/jgt.3190160111","article-title":"The value of the Ramsey numberR","volume":"16","author":"McKay","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1006\/jctb.1996.1741_TB961741RF19","series-title":"NAG Fortran Library","year":"1993"},{"key":"10.1006\/jctb.1996.1741_TB961741RF20","article-title":"Small Ramsey numbers","volume":"1","author":"Radziszowski","year":"1994","journal-title":"Electronic J. Combin., Dynamic Survey"},{"key":"10.1006\/jctb.1996.1741_TB961741RF21","first-page":"37","article-title":"OnRk","volume":"4","author":"Radziszowski","year":"1988","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1006\/jctb.1996.1741_TB961741RF22","series-title":"User's Manual for LINDO","author":"Schrage","year":"1981"},{"key":"10.1006\/jctb.1996.1741_TB961741RF23","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0195-6698(82)80038-3","article-title":"On finite Ramsey numbers","volume":"3","author":"Thomason","year":"1982","journal-title":"European J. Combin."},{"key":"10.1006\/jctb.1996.1741_TB961741RF24","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/S0021-9800(68)80070-5","article-title":"Dichromatic graphs and Ramsey numbers","volume":"5","author":"Walker","year":"1968","journal-title":"J. Combin. Theory"},{"key":"10.1006\/jctb.1996.1741_TB961741RF25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0097-3165(71)90002-1","article-title":"An upper bound for the Ramsey numberM","volume":"11","author":"Walker","year":"1971","journal-title":"J. Combin. Theory"},{"key":"10.1006\/jctb.1996.1741_TB961741RF26","doi-asserted-by":"crossref","first-page":"688","DOI":"10.2307\/1968214","article-title":"The colouring of graphs","volume":"33","author":"Whitney","year":"1932","journal-title":"Ann. Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895696917414?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895696917414?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T13:26:33Z","timestamp":1557235593000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895696917414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0095895696917414"],"URL":"https:\/\/doi.org\/10.1006\/jctb.1996.1741","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}